Frequent-pattern based iterative projected clustering

Irrelevant attributes add noise to high dimensional clusters and make traditional clustering techniques inappropriate. Projected clustering algorithms have been proposed to find the clusters in hidden subspaces. We realize the analogy between mining frequent itemsets and discovering the relevant subspace for a given cluster. We propose a methodology for finding projected clusters by mining frequent itemsets and present heuristics that improve its quality. Our techniques are evaluated with synthetic and real data; they are scalable and discover projected clusters accurately. © 2003 IEEE.published_or_final_versio

Frequent-pattern based iterative projected clustering

Irrelevant attributes add noise to high dimensional clusters and make traditional clustering techniques inappropriate. Projected clustering algorithms have been proposed to find the clusters in hidden subspaces. We realize the analogy between mining frequent itemsets and discovering the relevant subspace for a given cluster. We propose a methodology for finding projected clusters by mining frequent itemsets and present heuristics that improve its quality. Our techniques are evaluated with synthetic and real data; they are scalable and discover projected clusters accurately. © 2003 IEEE.published_or_final_versio

K−/K+K^-/K^+ multiplicity ratio for kaons produced in DIS with a large fraction of the virtual photon energy

For the first time, the $K^-/K^+$ multiplicity ratio is measured in deep-inelastic scattering for kaons carrying a large fraction $z$ of the virtual-photon energy. The data were obtained by the COMPASS collaboration using a 160 GeV muon beam and an isoscalar $^6$LiD target. The regime of deep-inelastic scattering is ensured by requiring $Q^2>1$ (GeV/$c)^2$ for the photon virtuality and $W>5$ GeV/$c^2$ for the invariant mass of the produced hadronic system. The Bjorken scaling variable range is $0.010.75$. For very large values of $z$, {\it i.e.} $z>0.8$, the results contradict expectations obtained using the formalism of (next-to-)leading order perturbative quantum chromodynamics. Our studies suggest that, within this formalism, an additional correction may be required to take into account the phase space available for hadronisation.Peer Reviewe

Efficient notification of meeting points for moving groups via independent safe regions

In applications like social networking services and online games, multiple moving users form a group and wish to be continuously notified with the best meeting point from their locations. To reduce the communication frequency of the application server, a promising technique is to apply safe regions, which capture the validity of query results with respect to the users' locations. Unfortunately, the safe regions in our problem exhibit characteristics such as irregular shapes and dependency among multiple safe regions. These unique characteristics render existing safe region methods that focus on a single safe region inapplicable to our problem. To tackle these challenges, we first examine the shapes of safe regions in our problem context and propose feasible approximations for them. We design efficient algorithms for computing these safe regions, as well as develop compression techniques for representing safe regions in a compact manner. Experiments with both real and synthetic data demonstrate the efficiency of our proposal in terms of computation and communication costs. © 2013 IEEE.published_or_final_versio

Efficient Notification of Meeting Points for Moving Groups via Independent Safe Regions

published_or_final_versio

Ranking spatial data by quality preferences

A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood. Such a neighborhood concept can be specified by the user via different functions. It can be an explicit circular region within a given distance from the flat. Another intuitive definition is to assign higher weights to the features based on their proximity to the flat. In this paper, we formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Extensive evaluation of our methods on both real and synthetic data reveals that an optimized branch-and-bound solution is efficient and robust with respect to different parameters. © 2006 IEEE.published_or_final_versio

Optimal matching between spatial datasets under capacity constraints

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The Capacity Constrained Assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between the customer and provider sets. For large spatial datasets, this graph is expensive to compute and it may be too large to fit in main memory. Motivated by this fact, we propose efficient algorithms for optimal assignment that employ novel edge-pruning strategies, based on the spatial properties of the problem. Additionally, we develop incremental techniques that maintain an optimal assignment (in the presence of updates) with a processing cost several times lower than CCA recomputation from scratch. Finally, we present approximate (i.e., suboptimal) CCA solutions that provide a tunable trade-off between result accuracy and computation cost, abiding by theoretical quality guarantees. A thorough experimental evaluation demonstrates the efficiency and practicality of the proposed techniques. © 2010 ACM.postprin

UV-Diagram: A Voronoi Diagram for Uncertain Spatial Databases

published_or_final_versio

Emergency placement of a self-expandable covered stent for carotid artery injury during trans-sphenoidal surgery

A patient sustained internal carotid artery (ICA) injury during trans-sphenoidal surgery. Bleeding from the resultant pseudo-aneurysm was not fully controlled by surgical packing. Emergency endovascular deployment over the injured ICA segment of a self-expandable covered-stent ('Symbiot' stent), initially designed for use in coronary saphenous vein-graft, was successful in securing haemostasis.postprin

Renal angiomyolipoma presenting with massive retroperitoneal haemorrhage due to deranged clotting factors: a case report

BACKGROUND: Angiomyolipomata of the kidney are unusual lesions composed of abnormal vasculature, smooth muscle, and adipose elements. They may be associated with tuberous sclerosis and occasionally present with flank pain, a palpable mass, and gross haematuria. As angiomyolipomata grow their risk of bleeding increases, with a greater than 50% chance of significant bleeding in lesions > 4 cm; anticoagulant therapy accentuates this risk. CASE PRESENTATION: A case of massive retroperitoneal haemorrhage in a patient on warfarin is presented. The underlying diagnosis of renal angiomyolipoma was diagnosed based on CT findings. Emergency resuscitation and selective interpolar arterial embolization was performed which saved the patient's life as well as his kidney. CONCLUSION: This case illustrates the clinical scenario of massive retroperitoneal haemorrhage in an anticoagulated patient with renal angiomyolipomata. In the emergent situation, adequate resuscitation along ABC principles, as well as control of haemorrhage with either nephrectomy (partial or radical), non-selective renal arterial embolization, or selective embolization of the feeding vessel(s), is necessary. For this to occur, it is imperative to consider the diagnosis early in warfarinized patients (and others at risk of bleeding) who present with abdominal pain. The authors hope this case report highlights to readers the clinical scenario of massive retroperitoneal haemorrhage in anticoagulated patients with renal angiomyolipomata so that they can deal appropriately with such presentations